Two-Layer Planarization parameterized by feedback edge set
نویسندگان
چکیده
منابع مشابه
Two-Layer Planarization Parameterized by Feedback Edge Set
Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by removing at most k edges. Since transforming G into a forest of caterpillar trees requires breaking every cycle, the size f of a minimum feedback edge set is a natural parameter with f ≤ k. We improve on previous fixed-parameter tract...
متن کاملTwo-Layer Planarization: Improving on Parameterized Algorithmics
A bipartite graph is biplanar if the vertices can be placed on two parallel lines in the plane such that there are no edge crossings when edges are drawn as straight-line segments connecting vertices on one line to vertices on the other line. We study two problems: • 2-Layer Planarization: can k edges be deleted from a given graph G so that the remaining graph is biplanar? • 1-Layer Planarizati...
متن کاملSimultaneous Feedback Edge Set: A Parameterized Perspective
In a recent article Agrawal et al. (STACS 2016) studied a simultaneous variant of the classic Feedback Vertex Set problem, called Simultaneous Feedback Vertex Set (Sim-FVS). In this problem the input is an n-vertex graph G, an integer k and a coloring function col : E(G)→ 2[α], and the objective is to check whether there exists a vertex subset S of cardinality at most k in G such that for all i...
متن کاملA Faster Parameterized Algorithm for Group Feedback Edge Set
In the Group Feedback Edge Set ( ) (Group FES( )) problem, the input is a group-labeled graph G over a group Γ of order and an integer k and the objective is to test whether there exists a set of at most k edges intersecting every non-null cycle in G. The study of the parameterized complexity of Group FES( ) was motivated by the fact that it generalizes the classical Edge Bipartization problem ...
متن کاملTwo-Layer Planarization in Graph Drawing
We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a given two-layer graph. Depending on the number of layers in which the vertices can be permuted freely, that is, zero, one or two, di erent versions of the problems arise. The latter problem was already investigated in [11] using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.01.029